Undecidability in number theory1
نویسنده
چکیده
Does the equation x+y+z = 29 have a solution in integers? Yes: (3, 1, 1), for instance. How about x+y+z = 30? Again yes, although this was not known until 1999: the smallest solution is (−283059965,−2218888517, 2220422932). And how about x+y+z = 33? This is an unsolved problem. Of course, number theory does not end with the study of cubic equations in three variables: one might ask also about xyz−163xyzt = 561.
منابع مشابه
Some Results on Additive Number Theory1
Let 0<ai<a2< ■ ■ -be any infinite sequence of integers. Denote by N(di, n) the number of a^n. I conjectured that to every sequence atthere corresponds a sequence bj of density 0 (i.e., such that lim„=0O (l/n)N(bj, n) = 0) so that every sufficiently large integer is of the form a,-+6yLorentz2 in a recent paper proved this conjecture; in fact, he showed that there exists a sequence bj with the re...
متن کاملOn the existence of absolutely undecidable sentences of number theory
This paper deals with the concept of absolute undecidability in mathematics. The main technical result concerns a particular sentence D expressed in the language of Peano Arithmetic. On basis of this result, it is argued that it is not possible to decideD in any “reasonable” formal theory T , under a wide definition of “reasonable”. The undecidability argument is independent of both T and its l...
متن کاملUndecidability of 2-Label BPP Equivalences and Behavioral Type Systems for the pi -Calculus
The trace equivalence of BPP was shown to be undecidable by Hirshfeld. We show that the trace equivalence remains undecidable even if the number of labels is restricted to two. The undecidability result holds also for the simulation of two-label BPP processes. These results imply undecidability of some behavioral type systems for the π-calculus.
متن کاملUndecidability of 2-Label BPP Equivalences and Behavioral Type Systems for the π-Calculus
The trace equivalence of BPP was shown to be undecidable by Hirshfeld. We show that the trace equivalence remains undecidable even if the number of labels is restricted to two. The undecidability result holds also for the simulation of two-label BPP processes. These results imply undecidability of some behavioral type systems for the π-calculus.
متن کامل